Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
نویسندگان
چکیده
منابع مشابه
Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di<erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can accommodate. In the class-constrained multiple knapsack (CCMK) problem, our goal is to maximize ...
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملPolynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems
We present a polynomial time approximation scheme for Euclidean TSP in <2. Given any n nodes in the plane and > 0, the scheme finds a (1 + )-approximation to the optimum traveling salesman tour in time nO(1= ). When the nodes are in <d, the running time increases to nÕ(logd 2 n)= d 1 . The previous best approximation algorithm for the problem (due to Christofides) achieves a 3=2approximation in...
متن کاملPolynomial time approximation schemes for the traveling repairman and other minimum latency problems
We give a polynomial time, (1+ )-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane, on weighted planar graphs, and on weighted trees. This improves on the known quasi-polynomial time approximation schemes for these problems. The algorithm is based on a simple technique that reduces the TRP to what we call the segmented TSP. Here, we are given numbers l1, ....
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0052-4